A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem

This paper presents a mixed-integer linear programming formulation for the multi-mode resource-constrained project scheduling problem with uncertain activity durations. We consider two-stage robust optimisation approach and find solutions that minimise worst-case makespan, whilst assuming durations lie in budgeted uncertainty set. Computational experiments show this easy-to-implement is many times faster than current state-of-the-art solution problem, solving over 40% more instances to optimality same benchmarking